Efficient path-based multicast in wormhole-routed mesh networks

The capability of multidestination wormhole allows a message to be propagated along any valid path in a wormholerouted network conforming to the underlying base routing scheme. The multicast on the path-based routing model is highly dependent on the spatial locality of destinations participating in multicasting. In this paper, we propose two proximity grouping schemes for ecient multicast in wormhole-routed mesh networks with multidestination capability by exploiting the spatial locality of the destination set. The ®rst grouping scheme, graph-based proximity grouping, is proposed to group the destinations together with locality to construct several disjoint sub-meshes. This is achieved by modeling the proximity grouping problem to graph partitioning problem. The second one, pattern-based proximity grouping, is proposed by the pattern classi®cation schemes to achieve the goal of the proximity grouping. By simulation results, we show the routing performance gains over the traditional Hamiltonian-path routing scheme. Ó 2000 Elsevier Science B.V. All rights reserved.